Zeros of a Class of Fibonacci-type Polynomials

نویسندگان

  • Yi Wang
  • Mingfeng He
چکیده

with the initial values G0(x) = a and G1(x) = x + b. The polynomials Gn−1(1, 0;x) and Gn(2, 0;x)(n ≥ 1) are just the usual Fibonacci polynomials Fn(x) and the Lucas polynomials Ln(x), respectively. Our concern in this paper is to study some of the properties of the zeros of the Fibonacci-type polynomials Gn(a, b;x). The zeros of Fn(x) and Ln(x) have been given explicitly by V. E. Hoggatt, Jr. and M. Bicknell[3] and N. Georgieva[2](see MR52#5634 for corrections by Reviewer). However there are no general formulae for the zeros of the Fibonacci-type polynomials. There have been quite a few papers concerned the properties of the zeros of the Fibonacci-type polynomials in recent years. For example, G. A. Moore[8] and H. Prodinger[9] investigated the asymptotic behavior of the maximal real zeros of Gn(−1,−1;x) respectively. The authors etc.[11] and F. Mátyás[5] investigated the same problem for Gn(a, a;x)(a < 0) and Gn(a,±a;x)(a 6= 0) respectively. In [6], F. Mátyás shown that the absolute values of complex zeros of polynomials Gn(a, b;x) do not exceed max{2, |a|+ |b|}, which generalizes the result of P. E. Ricci[10] who investigated the problem in the case a = b = 1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamics of the Zeros of Fibonacci Polynomials

The Fibonacci polynomials are defined by the recursion relation Fn+2{x) = xF„+l(x) + Fn(x), (1) with the initial values Fx(x) = 1 and F2(x) = x. When x = l, Fn(x) is equal to the /1 Fibonacci number, Fn. The Lucas polynomials, Ln(x) obey the same recursion relation, but have initial values Li(x) = x and L^x) = x +2. Explicit expressions for the zeros of the Fibonacci and Lucas polynomials have ...

متن کامل

Cube polynomial of Fibonacci and Lucas cubes

The cube polynomial of a graph is the counting polynomial for the number of induced k-dimensional hypercubes (k ≥ 0). We determine the cube polynomial of Fibonacci cubes and Lucas cubes, as well as the generating functions for the sequences of these cubes. Several explicit formulas for the coefficients of these polynomials are obtained, in particular they can be expressed with convolved Fibonac...

متن کامل

Some compact generalization of inequalities for polynomials with prescribed zeros

‎Let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial‎ ‎of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$‎. ‎In this paper we obtain some new results about the dependence of $|p(Rz)|$ on $|p(rz)| $ for $r^2leq rRleq k^2$‎, ‎$k^2 leq rRleq R^2$ and for $Rleq r leq k$‎. ‎Our results refine and generalize certain well-known polynomial inequalities‎.

متن کامل

Bounds for the Zeros of a Class of Lacunary–type Polynomials

In this paper, we present certain results concerning the location of the zeros of lacunarytpye polynomials which generalize and refine some known Cauchy type bounds for the zeros of polynomials.

متن کامل

Domain of attraction of normal law and zeros of random polynomials

Let$ P_{n}(x)= sum_{i=0}^{n} A_{i}x^{i}$ be a random algebraicpolynomial, where $A_{0},A_{1}, cdots $ is a sequence of independent random variables belong to the domain of attraction of the normal law. Thus $A_j$'s for $j=0,1cdots $ possesses the characteristic functions $exp {-frac{1}{2}t^{2}H_{j}(t)}$, where $H_j(t)$'s are complex slowlyvarying functions.Under the assumption that there exist ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002